Using Bonse’s Inequality to Find Upper Bounds on Prime Gaps
نویسنده
چکیده
One can apply Bonse’s inequality to points on the real line to find an upper bound on any prime gap, including both for first occurrences and for maximal prime gaps. However, such a result is neither as fine as the upper bound found by Mozzochi, nor as fine as the lower bound obtained by Rankin for maximal prime gaps. Without deep sieve methods, such as those used by Maier and Pomerance to compute a lower bound for maximal prime gaps, we show one can use Bonse’s inequality to arrive at an upper bound for any given prime gap without intricate derivations for any real constants.
منابع مشابه
Upper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملEQUATIONS AND INEQUALITIES INVOLVING vp(n!)
In this paper we study vp(n!), the greatest power of prime p in factorization of n!. We find some lower and upper bounds for vp(n!), and we show that vp(n!) = n p−1 + O(lnn). By using the afore mentioned bounds, we study the equation vp(n!) = v for a fixed positive integer v. Also, we study the triangle inequality about vp(n!), and show that the inequality pp > qq holds for primes p < q and suf...
متن کاملFinding prime pairs with particular gaps
By a prime gap of size g, we mean that there are primes p and p + g such that the g − 1 numbers between p and p + g are all composite. It is widely believed that infinitely many prime gaps of size g exist for all even integers g. However, it had not previously been known whether a prime gap of size 1000 existed. The objective of this article was to be the first to find a prime gap of size 1000,...
متن کاملSome inequalities concerning Smarandache's function
The objectives of this article are to study the sum IS(d) and to find some upper din bounds for Smarandache's function. This sum is proved to satisfy the inequality IS(d) ~ n at most all the composite numbers, Using this inequality, some new din upper bounds for Smarandache's function are found. These bounds improve the well-known inequality Sen) ~ n.
متن کاملOn Strings of Consecutive Integers with a Distinct Number of Prime Factors
Let ω(n) be the number of distinct prime factors of n. For any positive integer k let n = nk be the smallest positive integer such that ω(n + 1), . . . , ω(n + k) are mutually distinct. In this paper, we give upper and lower bounds for nk. We study the same quantity when ω(n) is replaced by Ω(n), the total number of prime factors of n counted with repetitions. Let ω(n) and Ω(n) denote respectiv...
متن کامل